Tactical planning vehicle routing with call-in customers

نویسندگان

  • Anirudh Subramanyam
  • Frank Mufalli
  • Jose M. Pinto
  • Chrysanthos E. Gounaris
چکیده

During the tactical planning of multi-period vehicle routing operations, dispatchers must incorporate enough flexibility in their routing plans to accommodate potential customers who have not yet called in to place their order. We develop an Adaptive Robust Optimization framework to address this challenging problem and solve instances to guaranteed optimality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integration of Multi-period Vehicle Routing Problem and Economic Selection of Customers with the Objective of Optimizing Distribution, Sales and Discounts Planning

Making decisions about the economic selection of the customers plays a significant role in the sale and logistic management of the companies. Furthermore, another issue affecting the relationship between the suppliers and the customers is the proper and timely distribution of the products as well as the optimum mixing of the distribution routes to reduce transportation costs. In this paper, the...

متن کامل

A mixed integer linear programming formulation for a multi-stage, multi-Product, multi-vehicle aggregate production-distribution planning problem

In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...

متن کامل

Modeling Techniques for Periodic Vehicle Routing Problems

This paper presents a continuous approximation model for the Period Vehicle Routing Problem with Service Choice (PVRP-SC). The PVRP-SC is a variant of the Period Vehicle Routing Problem in which the visit frequency to nodes is a decision of the model. This variation can result in more e±cient vehicle tours and/or greater service bene ̄t to customers. The continuous approximation model can facili...

متن کامل

STOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES

The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...

متن کامل

An Inventory Routing Problem for Perishable Products with Stochastic Demands and Direct Deliveries

In any supply chain, distribution planning of products is of great importance to managers. With effective and flexible distribution planning, mangers can increase the efficiency of time, place, and delivery utility of whole supply chain. In this paper, inventory routing problem (IRP) is applied to distribution planning of perishable products in a supply chain. The studied supply chain is compos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016